Correct program parallelisations

Abstract A commonly used approach to develop deterministic parallel programs is augment a sequential program with compiler directives that indicate which blocks may potentially be executed in parallel. This paper develops verification technique reason about such directives, particular show they do not change the behaviour of program. Moreover, tool-supported and can combined proving functional correctness To our technique, we propose simple intermediate representation (syntax semantics) captures main forms programs. language distinguishes three kinds basic blocks: parallel, vectorised blocks, composed using different composition operators: sequential, fusion composition. We how widely subset OpenMP encoded into this representation. Our builds on notion iteration contract specify blocks; if contracts are manually specified for single then sufficient automatically data race freedom also it establish linearised version original conclude Finally, exemplify an example program, discuss tool support provided.